package bintree.leetcode;

//104. 二叉树的最大深度

public class Num104_maxDepth {
    public int maxDepth(TreeNode root) {
        if(root==null){
            return 0;
        }
        int left=maxDepth(root.left);
        int right=maxDepth(root.right);
        int maxValue=Math.max(left,right);
        return 1+maxValue;

        //简写
        //return 1+Math.max(maxDepth(root.left),maxDepth(root.right));

    }
}
